SDMap: An Abstraction for Collecting Data over a Sensor Network
نویسنده
چکیده
This paper presents a new model for sensor networks, Shared Distribution Map (SDMap). One challenge for sensor networks from the perspective of a network architecture is the way the recipients of sensor data handle them. Instead of a socket-type interface, we provide a twodimensional map of data distribution that is visible to all receiving nodes. SDMap has several features: automatic elaboration of an area exhibiting a large change in data, data freshness control, and synchronization among caches. A recipient can either subscribe to a portion of the map or request for data at specific area without being aware of the underlying network. In this paper we describe the design issues for SDMap.
منابع مشابه
An Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks
LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...
متن کاملLeach Routing Algorithm Optimization through Imperialist Approach
Routing is an important challenge in WSN due to the presence of hundreds or thousands of sensor nodes. Low Energy Adaptive Clustering Hierarchy (LEACH) is a hierarchical routing and data dissemination protocol. LEACH divides a network domain into several sub-domains that are called clusters. Non-uniformity of cluster distribution and CHs selection without considering the positions of other sens...
متن کاملA multiple criteria algorithm for planning the itinerary of mobile sink in wireless sensor networks
The mobile sink can increase the efficiency of wireless sensor networks. It moves in a monitored environment and collects the network nodes information. Thus, by the sink we can balance the power consumption and increases the network lifetime. Determining path of the sink's movement is usually modeled as an optimization problem where finding optimal solutions require collecting value of all the...
متن کاملClassification and Comparison of Methods for Discovering Coverage Loss Areas in Wireless Sensor Networks
In recent years, wireless sensor networks data is taken into consideration as an ideal source, in terms of speed, accuracy and cost, in order to study the Earth's surface. One of the most important challenges in this area, is the signaling network coverage and finding holes. In recent years, wireless sensor networks data is taken into consideration as an ideal source, in terms of speed, accurac...
متن کاملTracking performance of incremental LMS algorithm over adaptive distributed sensor networks
in this paper we focus on the tracking performance of incremental adaptive LMS algorithm in an adaptive network. For this reason we consider the unknown weight vector to be a time varying sequence. First we analyze the performance of network in tracking a time varying weight vector and then we explain the estimation of Rayleigh fading channel through a random walk model. Closed form relations a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003